Interactive proof systems and alternating time—space complexity
نویسندگان
چکیده
منابع مشابه
The Knowledge Complexity of Interactive Proof Systems
Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian. In this paper a computational complexity theory of the "knowledge" contained in a proof is developed. Z...
متن کاملRelativization and Interactive Proof Systems in Parameterized Complexity Theory
We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized complexity classes. Here we obtain a new and non-trivial characterization of the A-Hierarchy in terms of oracle machines, and parameterize a famous result of Baker, ...
متن کاملThe Complexity of Space Boundes Interactive Proof Systems
An early motivation for the study of interactive proof systems was to extend the notion of NP as the class of problems with efficient “proofs of membership”. Informally, a prover can convince a verifier in polynomial time that a string is in an NP language, by presenting a witness of that fact to the verifier. Suppose that the power of the verifier is extended so that it can flip coins and can ...
متن کاملInteractive Proof Systems
We show a rough equivalence between alternating time-space complexity and a public-coin interactive proof system with the veriier having a polynomial related time-space complexity. Special cases include All of NC has interactive proofs with a log-space polynomial-time public-coin veriier vastly improving the best previous lower bound of LOGCFL for this model 7]. All languages in P have interact...
متن کاملInteractive Proof Systems
We intoduce the notion of interactive proof systems and the complexity classes IP, AM, MA, emphazing the role of randomness and interaction in these models. The concept is demonstrated by giving an interactive proof system for the graph non-isomorphism problem. We discuss issues regarding the relations between the complexity classes with respect to the number of rounds allowed. Furthermore we g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90210-k